The hidden computation steps of Turbo ASMs
نویسندگان
چکیده
Turbo Abstract State Machines are ASMs with parallel and sequential composition and possibly recursive submachine calls. Turbo ASMs are viewed as black-boxes that can combine arbitrary many steps of one or more submachines into one big step. The intermediate steps of a turbo ASM are not observable from outside. It is not even clear what exactly the intermediate steps are, because the semantics of turbo ASMs is usually defined inductively along the call graph of the ASM and the structure of the rule bodies. The most important application of turbo ASMs are recursive algorithms. Such algorithms can directly be simulated on turbo ASMs without transforming them into multi-agent (distributed) ASMs. In this article we analyze the hidden intermediate steps of turbo ASMs and characterize them using PAR/SEQ trees. We also address the problem of the reserve in the presence of recursion and sequential composition.
منابع مشابه
Remarks on Turbo ASMs for Functional Equations and Recursion Schemes
The question raised in [15] is answered how to naturally model widely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully reflect the common intuitive single-agent understanding of recursion. The argument is illustrated by turbo ASMs for Mergesort and Quicksort. Using turbo ASMs for returning function values allows one to seamlessly in...
متن کاملDistributed Abstract State Machines and Their Expressive Power
State Machines have been introduced as a “computation model that is more powerful and more universal than the standard computation models” by Yuri Gurevich in 1985 [11]. This is achieved by adopting classical concepts from logics and universal algebra, and their conservative extension to describe sequential steps. A number of variants of ASMs evolved over time, in particular parallel, distribut...
متن کاملConcurrent Abstract State Machines and +CAL Programs
We apply the ASM semantics framework to define the await construct in the context of concurrent ASMs. We link CAL programs to concurrent control state ASMs with turbo ASM submachines.
متن کاملA Security Logic for Abstract State Machines
We extend the logic for Abstract State Machines by a read predicate that allows to make precise statements about the accesses of locations of an ASM. The logic can be used to prove security properties of ASMs like that the machine does not read locations containing critical information or that all accesses of the machine are in a well-defined region of the abstract memory. The new read predicat...
متن کاملA logic for secure memory access of abstract state machines
We extend the logic for Abstract State Machines by a read predicate that allows to make precise statements about the accesses of locations of an ASM. The logic can be used to prove security properties of ASMs like that the machine does not read locations containing critical information or that all accesses of the machine to the abstract memory are permitted. The new read predicate is also usefu...
متن کامل